A New Fenchel Dual Problem in Vector Optimization

نویسندگان

  • Radu Ioan Boţ
  • Anca Dumitru
  • Gert Wanka
چکیده

We introduce a new Fenchel dual for vector optimization problems inspired by the form of the Fenchel dual attached to the scalarized primal multiobjective problem. For the vector primal-dual pair we prove weak and strong duality. Furthermore, we recall two other Fenchel-type dual problems introduced in the past in the literature, in the vector case, and make a comparison among all three duals. Moreover, we show that their sets of maximal elements are equal.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Strong and Converse Fenchel Duality for Vector Optimization Problems in Locally Convex Spaces

In relation to the vector optimization problem v-minx∈X(f + g ◦ A)(x), with f, g proper and cone-convex functions and A : X → Y a linear continuous operator between separated locally convex spaces, we define a general vector Fenchel-type dual problem. For the primal-dual pair we prove weak, and under appropriate regularity conditions, strong and converse duality. In the particular case when the...

متن کامل

Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces

We consider the DC optimization problem (P) inf x∈X {(f1(x) − f2(x)) + (g1(Ax) − g2(Ax))}, where f1, f2, g1 and g2 are proper convex functions defined on locally convex Hausdorff topological vector spaces X and Y respectively, and A is a linear continuous operator from X to Y . Adopting the standard convexification technique, a Fenchel dual problem of (P) is given. By using properties of the ep...

متن کامل

Regression tasks in machine learning via Fenchel duality

Supervised learning methods are powerful techniques to learn a function from a given set of labeled data, the so-called training data. In this paper the support vector machines approach for regression is investigated under a theoretical point of view that makes use of convex analysis and Fenchel duality. Starting with the corresponding Tikhonov regularization problem, reformulated as a convex o...

متن کامل

Farkas-Type Results With Conjugate Functions

Abstract. We present some new Farkas-type results for inequality systems involving a finite as well as an infinite number of convex constraints. For this, we use two kinds of conjugate dual problems, namely an extended Fenchel-type dual problem and the recently introduced FenchelLagrange dual problem. For the latter, which is a ”combination” of the classical Fenchel and Lagrange duals, the stro...

متن کامل

Duality and optimality conditions for generalized equilibrium problems involving DC functions

We consider a generalized equilibrium problem involving DC functions which is called (GEP). For this problem we establish two new dual formulations based on Toland-Fenchel-Lagrange duality for DC programming problems. The first one allows us to obtain a unified dual analysis for many interesting problems. So, this dual coincides with the dual problem proposed by Martinez-Legaz and Sosa in [23] ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008